The Lattice of Cyclic Flats of a Matroid
نویسنده
چکیده
Matroid theory is a combinatorial abstraction of geometry, with flats playing the role of subspaces. Cyclic flats are special flats that contain key geometric information about a matroid. This talk presents a variety of recent results and open problems about the lattice of cyclic flats. In particular, we show that every finite lattice arises as the lattice of cyclic flats of a (fundamental transversal) matroid and we show how the ideas used to prove this result give a simple proof of a new, sharper version of Dilworth’s embedding theorem. We present an axiom scheme for matroid theory based on cyclic flats and their ranks, the applications of which include results on realizing matroids as intersections of other matroids. We present the only known minor-closed class of matroids that is well-quasi-ordered yet has infinitely many excluded minors. We also sketch other directions in which the theory is developing. This talk, which is based on joint work with Anna de Mier (Universitat Politècnica de Catalunya), will include enough background on matroid theory to be reasonably widely accessible.
منابع مشابه
Some Properties of Cyclic Flats of an Infinite Matroid
We prove that when a pre-independence space satisfies some natural properties, then its cyclic flats form a bounded lattice under set inclusion. Additionally, we show that a bounded lattice is isomorphic to the lattice of cyclic flats of a pre-independence space. We also prove that the notion of cyclic width gives rise to dual-closed and minorclosed classes of B-matroids. Finally, we find a dif...
متن کاملComputing the Tutte Polynomial of a Matroid from its Lattice of Cyclic Flats
We show how the Tutte polynomial of a matroid M can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of M is already determined by the abstract lattice of its cyclic flats together with their cardinalities and ranks. They furthermore generalize similiar statements for perfect matroid designs and near d...
متن کاملOn Binary Matroid Minors and Applications to Data Storage over Small Fields
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address th...
متن کاملTransversal Lattices
A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way. A lattice is a Tr-lattice if all matroids whose lattices of cyclic flats are isomorphic to it are transversal. We investigate some sufficient conditions for a lattice to be a Tr-lattice; a corollary is that distributive lattices of ...
متن کاملThe Lattice of Flats and its Underlying Flag Matroid Polytope
Let M be a matroid and F the collection of all linear orderings of bases ofM. orflags of M. We define the flag matroid polytope A(F)We determine when two vertices of A(F) are adjacent, and provide a bijection between maximal chains in the lattice of flats of M and certain maximal faces of A(F).
متن کامل